Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
نویسندگان
چکیده
منابع مشابه
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
Article history: Received 7 February 2017 Received in revised form 28 April 2017 Accepted 30 May 2017 Available online 7 June 2017 Communicated by S.-Y. Hsieh
متن کاملThe Relationship between Connectivity and Diagnosability on Regular Networks
The node connectivity is usually used to measure the fault tolerance of a multiprocessor system. On the other hand, the diagnosability is an important ability to provide a system level self-diagnosis for maintaining the reliability of a multiprocessor system. It is interesting to investigate the relationship between the connectivity and the diagnosability. Two diagnosis models: PMC model and co...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملThe tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes
Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. In 2016, Zhang et al. proposed the g-extra diagnosability of G, which restrains that every component of G − S has at least (g + 1) vertices. As an important...
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.05.036